package DynamicProgramming;
/*
 * 最长公共子序列
 */
public class lc11443 {

    public int longestCommonSubsequence(String text1, String text2) {
        char[] text11 = text1.toCharArray();
        char[] text21 = text2.toCharArray();
        int len1 = text11.length;
        int len2 = text21.length;
        int[][] dp = new int[len1 + 1][len2 + 1];
        for (int i = 1; i <= len1; i++) {
            for (int j = 1; j <= len2; j++) {
                if (text11[i - 1] == text21[j - 1]) {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                } else {
                    dp[i][j] = Math.max(dp[i][j - 1], dp[i - 1][j]);
                }
            }
        }
        return dp[len1][len2];
    }

}
